Graph Transformation with Incremental Updates
نویسندگان
چکیده
منابع مشابه
Graph Transformation with Incremental Updates
We propose an efficient implementation technique for graph transformation systems based on incremental updates. The essence of the technique is to keep track of all possible matchings of graph transformation rules in database tables, and update these tables incrementally to exploit the fact that rules typically perform only local modifications to models.
متن کاملGraph transformation for incremental natural language analysis
Millstream systems have been proposed as a non-hierarchical method for modelling natural language. Millstream configurations represent and connect multiple structural aspects of sentences. We present a method by which the Millstream configurations corresponding to a sentence are constructed. The construction is incremental, that is, it proceeds as the sentence is being read and is complete when...
متن کاملTowards Incremental Graph Transformation in Fujaba
I discuss a technique for on-the-fly model transformations based on incremental updates. The essence of the technique is to keep track of all possible matchings of graph transformation rules, and update these matchings incrementally to exploit the fact that rules typically perform only local modifications to models. The proposal is planned to be implemented as a plug-in for the Fujaba graph tra...
متن کاملHigh-dimensional kNN joins with incremental updates
The k Nearest Neighbor (kNN) join operation associates each data object in one data set with its k nearest neighbors from the same or a different data set. The kNN join on high-dimensional data (high-dimensional kNN join) is an especially expensive operation. Existing high-dimensional kNN join algorithms were designed for static data sets and therefore cannot handle updates efficiently. In this...
متن کاملIncremental Dynamic Updates with First-Class Contexts
Highly available software systems occasionally need to be updated while avoiding downtime. Dynamic software updates reduce downtime, but still require the system to reach a quiescent state in which a global update can be performed. This can be difficult for multi-threaded systems. We present a novel approach to dynamic updates using firstclass contexts, called Theseus. First-class contexts make...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2004
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2004.02.057